Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
نویسندگان
چکیده
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In general, 1-planar graphs do not admit straightline drawings. We show that every 3-connected 1-planar graph has a straight-line drawing on an integer grid of quadratic size, with the exception of a single edge on the outer face that has one bend. The drawing can be computed in linear time from any given 1-planar embedding of the graph.
منابع مشابه
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. It is well known that a planar graph of n vertices admits a straight-line grid drawing on a grid of area O(n). A lower bound of Ω(n) on the area-requirement for straight-line grid drawings o...
متن کاملCanonical Ordering for Graphs on the Cylinder, with Applications to Periodic Straight-line Drawings on the Flat Cylinder and Torus
We extend the notion of canonical ordering (initially developed for planar triangulations and 3-connected planar maps) to cylindric (essentially simple) triangulations and more generally to cylindric (essentially internally) 3connected maps. This allows us to extend the incremental straight-line drawing algorithm of de Fraysseix, Pach and Pollack (in the triangulated case) and of Kant (in the 3...
متن کاملConvex Grid Drawings of 3-Connected Planar Graphs
We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, non-intersecting line segments and faces are convex polygons. We present a linear-time algorithm which, given an n-vertex 3connected plane graph G (with n 3), nds such a straight-line convex embedding of G into a (n 2) (n 2) grid.
متن کاملNon-aligned Drawings of Planar Graphs
A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible n × n-grid. They also showed that such drawings exist if up to n− 3 edges may have a bend. In this paper, we give algorithms for non-aligned planar drawings that imp...
متن کاملStraight - Line Drawings on Restricted
This paper investigates the following question: Given an integer grid , where is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit straight-line crossing-free drawings with vertices located at the grid points of ? We characterize the trees that can be drawn on a two dimensional c n k grid, where k and c are given integer constants, and on a two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013